Semantic Matching and Heuristic Search for a Dynamic Tour Guide
نویسندگان
چکیده
A lack of information forces many tourists on the same crowded paths. The Dynamic Tour Guide (DTG) is a mobile agent hich computes an itinerary of a couple of hours to explore a city. For this the DTG interrogates Tour Building Blocks (TBB), e.g. potential sights or restaurants, to determine current information, e.g. opening hours or availability. An ontology is used to capture the profiles of the TBBs and the interests of a tourist. Both are used by a semantic match algorithm to rank the TBBs. Based on the start point and the available time period a heuristic approximate algorithm computes an individual tour ithin seconds. Benchmarks of relevant complexity have sho n that a tour co mputed in 5 seconds deviates only by 5% from the optimal tour.
منابع مشابه
Two new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملA Framework for Adapting Population-Based and Heuristic Algorithms for Dynamic Optimization Problems
In this paper, a general framework was presented to boost heuristic optimization algorithms based on swarm intelligence from static to dynamic environments. Regarding the problems of dynamic optimization as opposed to static environments, evaluation function or constraints change in the time and hence place of optimization. The subject matter of the framework is based on the variability of the ...
متن کاملGenetic Algorithms with Heuristic - Knight's Tour Problem
Genetic algorithms are good search techniques for finding solutions to NP problems. However, their high degree of randomness sometimes fails to guide the search towards finding solutions within reasonable costs. The Knight’s tour problem is an example of where pure GAs fail (practically) to find solutions. Combining GAs with other approaches on the other hand can highly improve their efficiency...
متن کاملA Hybrid Meta-heuristic for the Dynamic Layout Problem with Transportation System Design
This paper primarily presents a comprehensive dynamic layout design model which integrates layout and transportation system design via considering more realistic assumptions, such as taking account of fixed-position departments and distance between departments that endanger each other. In addition, specific criteria such as capacity, cost and reliability of facilities are considered in transpor...
متن کاملNew Heuristic Algorithms for Solving Single-Vehicle and Multi-Vehicle Generalized Traveling Salesman Problems (GTSP)
Among numerous NP-hard problems, the Traveling Salesman Problem (TSP) has been one of the most explored, yet unknown one. Even a minor modification changes the problem’s status, calling for a different solution. The Generalized Traveling Salesman Problem (GTSP)expands the TSP to a much more complicated form, replacing single nodes with a group or cluster of nodes, where the objective is to fi...
متن کامل